Classification for the Concrete Syntax of Graph-Like Modeling Languages

Abstract A classification scheme for Graph-Like Modeling Languages (GLML) is presented in this paper. The novelty of classifier lies its application to a meta-model GLML that deviates from the simple graph model and underlies large number GLML. main goal using support reuse layout algorithms are used directly or indirectly development software by model-based engineering techniques. In other domains, graph-like models artifacts (e.g., circuit diagrams, energy flow diagrams) serve as input downstream specialized applications (simulators, optimizers). concrete syntax language creating, editing, understanding highly important modeling tools. Layout methods languages have be implemented achieve tools with good usability. Developing complex topic covered field Graph Drawing. However, there no existing procedure determine which algorithm can Matching achieved applying scheme.